Binary Arithmetic for DNA Computers

We propose a (recursive) DNA algorithm for adding two binary numbers which require O(log n) bio-steps using only O(n) different type of DNA strands, where n is the size of the binary string representing the larger of the two numbers. The salient feature of our technique is that the input strands and the output strands have exactly the same structure which makes it fully procedural unlike most methods proposed so far. Logical operations of binary numbers can easily be performed by our methods. I.S.I. Tech Report No. 13/2001 December 12, 2001 corresponding author work done at ISI Binary Arithmetic for DNA Computers Rana Barua‡ Janardan Misra§